from(X) → cons(X, from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
↳ QTRS
↳ DependencyPairsProof
from(X) → cons(X, from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
SEL(s(X), cons(Y, Z)) → SEL(X, Z)
FROM(X) → FROM(s(X))
from(X) → cons(X, from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
SEL(s(X), cons(Y, Z)) → SEL(X, Z)
FROM(X) → FROM(s(X))
from(X) → cons(X, from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
SEL(s(X), cons(Y, Z)) → SEL(X, Z)
from(X) → cons(X, from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
SEL(s(X), cons(Y, Z)) → SEL(X, Z)
The value of delta used in the strict ordering is 4.
POL(cons(x1, x2)) = 1 + (2)x_1 + (2)x_2
POL(s(x1)) = 0
POL(SEL(x1, x2)) = (4)x_2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
from(X) → cons(X, from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
FROM(X) → FROM(s(X))
from(X) → cons(X, from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)